A complete adaptive algorithm for propositional satisfiability
نویسندگان
چکیده
منابع مشابه
A Complete Adaptive Algorithm for Propositional Satisfiability
An approach to propositional satisfiability using an adaptive procedure is described. Its main feature is a new branching rule, which is able to identify, at an early stage, hard sub-formulae. Such branching rule is based on a simple and easy computable criterion, whose merit function is updated by a learning mechanism, and guides the exploration of a clause based branching tree. Completeness i...
متن کاملCLAS: a Complete Learning Algorithm for propositional Satisfiability
In this paper an approach is described for solving propositional Satisfiability problems, which makes use of an adaptive technique. Its main feature is a new enumeration scheme, which is able to identify, at an early stage, hard sub-formulae. This scheme is based on a simple and easy computable criterion, whose merit function is updated by a learning mechanism, and guides the exploration of a c...
متن کاملGRASP: A Search Algorithm for Propositional Satisfiability
ÐThis paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques that proved to be quite powerful on a wide variety of SAT problems. Some of these techniques are specific to SAT, whereas others are similar in spirit to approaches in other fields of Artificia...
متن کاملComplete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search algorithms are notoriously incomplete: They are not guaranteed to find a feasible solution if one exists and they cannot be used to determine unsatisfiability. We present an algorithmic framework for complete local sear...
متن کاملSatisfiability for Propositional Contexts
We propose a sound and complete satisfiability algorithm for propositional multi-context systems. In essence, the algorithm is a distribution policy built on top of local reasoning procedures, one for each context, which can be implemented by (a diversity of) customized state-of-the-art SAT solvers. The foremost intuition that has motivated our algorithm, and the very potential strength of cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00385-2